Cyclic Scheduling in Robotic Cells: An Extension of Basic Models in Machine Scheduling Theory
نویسندگان
چکیده
There is a growing interest on cyclic scheduling problems both in the scheduling literature and among practitioners in the industrial world. There are numerous examples of applications of cyclic scheduling problems in different industries (see, e.g., Hall (1999), Pinedo (2001)), automatic control (Romanovskii (1967), Cohen et al. (1985)), multi-processor computations (Hanen and Munier (1995), Kats and Levner (2003)), robotics (Livshits et al. (1974), Kats and Mikhailetskii (1980), Kats (1982), Sethi et al. (1992), Lei (1993), Kats and Levner (1997a, 1997b), Hall (1999), Crama et al. (2000), Agnetis and Pacciarelli (2000), Dawande et al. (2005, 2007)), and in communications and transport (Dauscha et al. (1985), Sharma and Paradkar (1995), Kubiak (2005)). It is, perhaps, a surprising thing that many facts in scheduling theory obtained as early as in the 1960s, are re-discovered and rerediscovered by the next generations of researchers. About two decades ago, this fact was noticed by Serafini and Ukovich (1989). The present survey uniformly addresses cyclic scheduling problems through the prism of the classical machine scheduling theory focusing on their features that are common for all aforementioned applications. Historically, the scheduling literature considered periodic machine scheduling problems in two major classes – called flowshop and jobshop in which setup and transportation times were assumed insignificant. Indeed, many machining centers can quickly switch tools, so the setup times for these situations may be small or negligible. There are a lot of results about cyclic flowshop and jobshop problems with negligible setup/transportation times. Advantages of cyclic scheduling policies over conventional (non-cyclic) scheduling in flexible manufacturing are widely discussed in the literature, we refer the interested reader to Karabati and Kouvelis (1996), Lee and Posner (1997), Hall et al. (2002), Seo and Lee (2002), Timkovsky (2004), Dawande et al. (2007), and numerous references therein. At the same time, modern flexible manufacturing systems are supplied by computercontrolled hoists, robots and other material handling devices such that the transportation and setup operation times are significant and should not be ignored. Robots have become a standard tool to serve cyclic transportation and assembling/disassembling processes in manufacturing of airplanes, automobiles, semiconductors, printed circuit boards, food
منابع مشابه
A New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic
In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...
متن کاملبهینه سازی هزینه کل تولید و زمان در سلول رباتیک سه ماشین
In this research, robotic cell scheduling problem with three CNC machines and with an operation on each machine with the purpose of optimizing manufacturing cost and time in S1 cycle has been investigated. To obtain the optimal total cost of production has been used the optimal processing time on machine operation. In this research, robotic cell scheduling is studied in three different situatio...
متن کاملGeneralized Cyclic Open Shop Scheduling and a Hybrid Algorithm
In this paper, we first introduce a generalized version of open shop scheduling (OSS), called generalized cyclic open shop scheduling (GCOSS) and then develop a hybrid method of metaheuristic to solve this problem. Open shop scheduling is concerned with processing n jobs on m machines, where each job has exactly m operations and operation i of each job has to be processed on machine i . However...
متن کاملA scalarization-based method for multiple part-type scheduling of two-machine robotic systems with non-destructive testing technologies
This paper analyzes the performance of a robotic system with two machines in which machines are configured in a circular layout and produce non-identical parts repetitively. The non-destructive testing (NDT) is performed by a stationary robotic arm located in the center of the circle, or a cluster tool. The robotic arm integrates multiple tasks, mainly the NDT of the part and its transition bet...
متن کاملMILP models and valid inequalities for the two-machine permutation flowshop scheduling problem with minimal time lags
In this paper, we consider the problem of scheduling on two-machine permutation flowshop with minimal time lags between consecutive operations of each job. The aim is to find a feasible schedule that minimizes the total tardiness. This problem is known to be NP-hard in the strong sense. We propose two mixed-integer linear programming (MILP) models and two types of valid inequalities which aim t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008